Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs
نویسندگان
چکیده
منابع مشابه
Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs
For a finite simple edge-colored connected graph G (the coloring may not be proper), a rainbow path in G is a path without two edges colored the same; G is rainbow connected if for any two vertices of G, there is a rainbow path connecting them. Rainbow connection number, rc(G), of G is the minimum number of colors needed to color its edges such that G is rainbow connected. Chakraborty et al. (2...
متن کاملSharp upper bound for the rainbow connection numbers of 2-connected graphs
An edge-colored graph G, where adjacent edges may be colored the same, is rainbow connected if any two vertices of G are connected by a path whose edges have distinct colors. The rainbow connection number rc(G) of a connected graph G is the smallest number of colors that are needed in order to make G rainbow connected. In this paper, we give a sharp upper bound that rc(G) ≤ ⌈n2 ⌉ for any 2-conn...
متن کاملRainbow connection number of dense graphs
An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this paper we show that rc(G) ≤ 3 if |E(G)| ≥ ( n−2 2 ) + 2, and rc(G) ≤ 4 if |E(G)| ≥ ( n−3 2 ) + 3. These bounds...
متن کاملChromatic Number of Square of Maximal Outerplanar Graphs
Let χ(G) denote the chromatic number of the square of a maximal outerplanar graph G and Q denote a maximal outerplanar graph obtained by adding three chords y1y3, y3y5, y5y1 to a 6-cycle y1y2 · · · y6y1. In this paper, it is proved that ∆+1 ≤ χ(G ) ≤ ∆+2, and χ(G) = ∆ + 2 if and only if G is Q, where ∆ represents the maximum degree of G.
متن کاملMonitoring maximal outerplanar graphs
In this paper we define a new concept of monitoring the elements of triangulation graphs by faces. Furthermore, we analyze this, and other monitoring concepts (by vertices and by edges), from a combinatorial point of view, on maximal outerplanar graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2012
ISSN: 0893-9659
DOI: 10.1016/j.aml.2011.08.006